Functions realized by consistent sequential machines

Highly Consistent Sequential Segmentation

This paper deals with segmentation of image sequences in an unsupervised manner with the goal of getting highly consistent segmentation results from frame-to-frame. We first introduce a segmentation method that uses results of the previous frame as initialization and significantly improves consistency in comparison to a single frame based approach. We also find correspondences between the segme...

Decision Issues on Functions Realized by Finite Automata

Minimal Sequential Interaction Machines

Persistent Turing Machines PTMs are an abstract model for sequential interactive comput ing marrying coinductive semantics with e ective constructibility They are multitape machines with work tape contents preserved between interactions whose behavior is characterized obser vationally by input output streams Notions of PTM equivalence and expressiveness have been studied proving that in non alg...

Sequential Support Vector Machines

In this paper, we derive an algorithm to train support vector machines sequentially. The algorithm makes use of the Kalman lter and is optimal in a minimum variance framework. It extends the support vector machine paradigm to applications involving real-time and non-stationary signal processing. It also provides a computationally eecient alternative to the problem of quadratic optimisation.

Sequential scheduling on identical machines

We study a sequential version of the well-known KP-model: Each of n agents has a job that needs to be processed on any of m machines. Agents sequentially select a machine for processing their jobs. The goal of each agent is to minimize the finish time of his machine. We study the corresponding sequential price of anarchy for m identical machines under arbitrary and LPT orders, and suggest insig...